Improved lower bound for deterministic broadcasting in radio networks
نویسندگان
چکیده
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every deterministic broadcasting protocol there exists a network, of radius 2, for which the protocol takes
منابع مشابه
Time of Radio Broadcasting: Adaptiveness vs. Obliviousness and Randomization vs. Determinism
We consider the time of broadcasting in ad hoc radio networks modeled as undirected graphs. In such networks, every node knows only its own label and a linear bound on the number of nodes but is unaware of the topology of the network, or even of its own neighborhood. Our aim is to study to what extent the availability of two important characteristics of a broadcasting algorithm influences optim...
متن کاملFaster Deterministic Broadcasting in Ad Hoc Radio Networks
We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log n). Our main...
متن کاملFast Broadcasting and Gossiping in Radio Networks
We establish an O(n log2 n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of (n logn). The fastest previously known algorithm for this problem works in time O(n3=2). Using our broadcasting algorithm, we develop an O(n3=2 log2 n) algorithm for gossiping in the same network model.
متن کاملEnergy and Time Efficient Broadcasting in Known Topology Radio Networks
The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V,E) where |V | = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D...
متن کاملLower Bounds on Broadcasting Time in UDG Radio Networks with Unknown Topology
The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Network stations are modeled as points in the plane, where a station is connected to all stations at Euclidean distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011